Latin and semi-Latin factorizations of complete graphs and support sizes of quadruple systems

نویسنده

  • S. Ajoodani-Namini
چکیده

paper) we introduce notions of Latin and semi-Latin factorizations and their support sizes. We determine the set support of Latin and factorizations of Utilizing r!{yt"'T'l'Yl1np the set QSS(8m, A) of support sizes of quadruple systems of order 8m and index A for m 6 with at most 5 OITllSSlOIlS for each m 0 Introd uction Let be a finite set and be a We denote by the set of all k-subsets of i:)U'DP()Se that B1 and two collections of the elements of Pk(X) and m is a positive collection of the elements of B1 and B2 will be denoted by B1 + B2 and m copies of 8 1 is denoted by mBl. The set of distinct elements of B1 is called the support of B1 and is denoted. The number b'" = IBil is called the support size of B 1 • Let Xl and X 2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs

Given a one-factorization F of the complete bipartite graph Kn,n, let pf(F) denote the number of Hamiltonian cycles obtained by taking pairwise unions of perfect matchings in F . Let pf(n) be the maximum of pf(F) over all one-factorizations F of Kn,n. In this work we prove that pf(n) > n2/4, for all n > 2. 1 Perfect one-factorizations A one-factorization of a graph G is a partition of its set o...

متن کامل

Quasi-embeddings and intersections of latin squares of different orders

We consider a common generalization of the embedding and intersection problems for latin squares. Specifically, we extend the definition of embedding to squares whose sides do not meet the necessary condition for embedding and extend the intersection problem to squares of different orders. Results are given for arbitrary latin squares, and those which are idempotent and idempotent symmetric. Th...

متن کامل

Cycle Switches in Latin Squares

Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one clas...

متن کامل

On the number of SQSs, latin hypercubes and MDS codes∗

It is established that the logarithm of the number of latin d-cubes of order n is Θ(n ln n) and the logarithm of the number of pairs of orthogonal latin squares of order n is Θ(n ln n). Similar estimations are obtained for systems of mutually strong orthogonal latin d-cubes. As a consequence, it is constructed a set of Steiner quadruple systems of order n such that the logarithm of its cardinal...

متن کامل

Optimal and efficient semi-Latin squares

Let n and k be integers, with n > 1 and k > 0. An (n × n)/k semi-Latin square S is an n × n array, whose entries (called blocks) are k-element subsets of a set of size nk, the set of symbols of S, such that each symbol of S occurs exactly once in each row and exactly once in each column of S. Semi-Latin squares form a class of designs generalising Latin squares, and have applications in areas i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1995